Towards HOL 2000 ? 1 Towards HOL 2000 ?

Towards a HOL Framework for the Deductive Analysis of Hybrid Control Systems

This paper describes a higher-order logic (HOL) based approach to the specification and verification of hybrid control systems. Control programs written in subsets of the IEC 61131-3 programming languages ST (Structured Text), FBD (Function Block Diagram) and SFC (Sequential Function Charts) are translated to automata in HOL. Hybrid systems are modelled as functions operating on discrete stream...

Towards the Formal Modeling of a Secure Operating System

To construct a secure operating system with high assurance, it is essential that the security architecture of the operating system can be analyzed vigorously and that the architecture can be easily understood by engineers who translate the design into code. In this paper we describe a partial model of the security policies of an operating system which implements a variant of the Bell-LaPadula m...

Steps towards Verified Implementations of HOL Light

This short paper describes our plans and progress towards construction of verified ML implementations of HOL Light: the first formally proved soundness result for an LCF-style prover. Building on Harrison’s formalisation of the HOL Light logic and our previous work on proof-producing synthesis of ML, we have produced verified implementations of each of HOL Light’s kernel functions. What remains...

Integrating SVC and HOL with the Prosper Toolkit ?

Taking the hol out of HOL

We describe a systematic approach to building tools for the automated analysis of specifications expressed in higher-order logic (hol) independent of a conventional, interactive theorem proving environment. In contrast to tools such as HOL and PVS, we have taken “the hol out of HOL” by building automated analysis procedures from a toolkit for manipulating hol specifications. Our approach elimin...